3 research outputs found

    Analyzing Code Tracking Algorithms for Galileo Open Service Signal

    Get PDF
    The ever-increasing public interest on location and positioning services has originated a demand for higher performance Global Navigation Satellite Systems (GNSSs). Galileo Open Service (OS) signal, part of the European contribution to future GNSS, was designed to respond to the above demand. In all GNSSs, the estimation with high accuracy of the Line-Of-Sight (LOS) delay is a prerequisite. The Delay Lock Loops (DLLs) and their enhanced variants (i.e., feed-back code tracking loops) are the structures of choice for the commercial GNSS receivers, but their performance in severe multipath scenarios is still rather limited. In addition, the new satellite positioning system proposals specify the use of a new modulation, the Binary Oļ¬€set Carrier (BOC) modulation, which triggers a new challenge in the code tracking stage. Therefore, in order to meet this emerging challenge and to improve the accuracy of the delay estimation in severe multipath scenarios, this thesis analyzes feed-back as well as feed-forward code tracking algorithms and proposes a novel algorithm, namely Peak Tracking (PT), which is a combination of both feed-back and feed-forward structures and utilizes the advantages inherent in these structures. In this thesis, the code tracking algorithms are studied and analyzed for Sine BOC (SinBOC) modulated Galileo OS signal for various multipath proļ¬les in Rayleigh fading channel model. The performance of the analyzed algorithms are measured in terms of various well-known criteria such as Root-Mean-Square-Error (RMSE), Mean-Time-to-Lose Lock (MTLL), delay error variance and Multipath Error Envelopes (MEEs). The simulation results show that the proposed PT algorithm outperforms all other analyzed algorithms in various multipath proļ¬les in good Carrier-to-Noise-Ratios (CNRs). The simulation results are compared with the theoretical Cramer-Rao Bound (CRB) and the comparison shows that the delay error variance for PT algorithm approaches the theoretical limit with the increase in CNR. Therefore, the proposed algorithm can be considered as an excellent candidate for implementation in future Galileo receivers, especially when tracking accuracy is a concern. /Kir1

    Analyzing Code Tracking Algorithms for Galileo Open Service Signal

    Get PDF
    The ever-increasing public interest on location and positioning services has originated a demand for higher performance Global Navigation Satellite Systems (GNSSs). Galileo Open Service (OS) signal, part of the European contribution to future GNSS, was designed to respond to the above demand. In all GNSSs, the estimation with high accuracy of the Line-Of-Sight (LOS) delay is a prerequisite. The Delay Lock Loops (DLLs) and their enhanced variants (i.e., feed-back code tracking loops) are the structures of choice for the commercial GNSS receivers, but their performance in severe multipath scenarios is still rather limited. In addition, the new satellite positioning system proposals specify the use of a new modulation, the Binary Oļ¬€set Carrier (BOC) modulation, which triggers a new challenge in the code tracking stage. Therefore, in order to meet this emerging challenge and to improve the accuracy of the delay estimation in severe multipath scenarios, this thesis analyzes feed-back as well as feed-forward code tracking algorithms and proposes a novel algorithm, namely Peak Tracking (PT), which is a combination of both feed-back and feed-forward structures and utilizes the advantages inherent in these structures. In this thesis, the code tracking algorithms are studied and analyzed for Sine BOC (SinBOC) modulated Galileo OS signal for various multipath proļ¬les in Rayleigh fading channel model. The performance of the analyzed algorithms are measured in terms of various well-known criteria such as Root-Mean-Square-Error (RMSE), Mean-Time-to-Lose Lock (MTLL), delay error variance and Multipath Error Envelopes (MEEs). The simulation results show that the proposed PT algorithm outperforms all other analyzed algorithms in various multipath proļ¬les in good Carrier-to-Noise-Ratios (CNRs). The simulation results are compared with the theoretical Cramer-Rao Bound (CRB) and the comparison shows that the delay error variance for PT algorithm approaches the theoretical limit with the increase in CNR. Therefore, the proposed algorithm can be considered as an excellent candidate for implementation in future Galileo receivers, especially when tracking accuracy is a concern. /Kir1

    Aroma based localization in GNSS-denied environments

    Get PDF
    This paper studies infrastructure less localization solutions using aroma fingerprints. These fingerprints are collected under varying conditions from different indoor locations using Ion Mobility Spectrometry based Electronic Noses. A supervised machine learning algorithm for data processing location estimation is proposed. The non-parametric system is trained with data from all locations, and its performance evaluated using data from the same locations collected under different environmental conditions. Five different classifiers are studied and tested for location estimation. The Stochastic Gradient Descent classifier achieved the highest accuracy, with the ķ‘˜NN with Euclidian distance also performing reliably under different conditions
    corecore